Lecture 3 : Privacy and Weak Sources
نویسنده
چکیده
Let’s quickly review some results from previous lectures. Definition 1 Let (Enc,Dec) denote an encryption scheme where Enc : {0, 1}m×{0, 1}n → {0, 1}λ and Dec : {0, 1}m × {0, 1}λ → {0, 1}n are functions. A correct encryption scheme satisfies ∀r, x Decr(Encr(x)) = x. Let R and X denote distributions on r and x respectively. (Enc,Dec) is said to be (k, ε)-secure if it is (R, ε)-secure for every k-source R; i.e. H∞(R) ≥ k. Clearly, ε = 0 means perfect security on k-sources. ♦
منابع مشابه
Randomness in Cryptography January 24 , 2013 Lecture 3 : Privacy and Weak Sources
Let’s quickly review some results from previous lectures. Definition 1 Let (Enc,Dec) denote an encryption scheme where Enc : {0, 1}m×{0, 1}n → {0, 1}λ and Dec : {0, 1}m × {0, 1}λ → {0, 1}n are functions. A correct encryption scheme satisfies ∀r, x Decr(Encr(x)) = x. Let R and X denote distributions on r and x respectively. (Enc,Dec) is said to be (k, ε)-secure if it is (R, ε)-secure for every k...
متن کاملRFID Security and Privacy - Concepts, Protocols, and Architectures
Well, someone can decide by themselves what they want to do and need to do but sometimes, that kind of person will need some rfid security and privacy concepts protocols and architectures references. People with open minded will always try to seek for the new things and information from many sources. On the contrary, people with closed mind will always think that they can do it by their princip...
متن کاملLecture 5 : SV - robust Mechanisms and Bias - Control - Limited Source
We have seen that additive noise technique is not (SV (γ), ε)-DP. So, the question that we explore in todays class is whether differential privacy (DP) is achievable with SV sources. Interestingly, we give a differential private mechanism for approximate arbitrary “low sensitive” functions that works even with randomness coming from SV source, for any γ < 1. We conclude todays lecture with some...
متن کاملSecrecy Without Perfect Randomness: Cryptography with (Bounded) Weak Sources
Cryptographic protocols are commonly designed and their security proven under the assumption that the protocol parties have access to perfect (uniform) randomness. Physical randomness sources deployed in practical implementations of these protocols often fall short in meeting this assumption, but instead provide only a steady stream of bits with certain high entropy. Trying to ground cryptograp...
متن کاملWhen being Weak is Brave: Privacy Issues in Recommender Systems
We explore the conflict between personalization and privacy that arises from the existence of weak ties. A weak tie is an unexpected connection that provides serendipitous recommendations. However, information about weak ties could be used in conjunction with other sources of data to uncover identities and reveal other personal information. In this article, we use a graph-theoretic model to stu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014